Overcoming Rule-Based Rigidity and Connectionist Limitations through Massively-Parallel Case-Based Reasoning
نویسندگان
چکیده
Symbol manipulation as used in traditional Artificial Intelligence has been criticized by neural net researchers for being excessively inflexible and sequential. On the other hand, the application of neural net techniques to the types of high-level cognitive processing studied in traditional artificiaa intelligence presents major problems as well. We claim that a promising way out of this impasse is to build neural net models that accomplish massively paraliel case-based reasoning. Casebased reasoning, which has received much attention recently, is essentially the same as analogybased reasoning, and avoids many of the problems leveled at traditional artificial intelligence. Further problems are avoided by doing many strands of case-based reasoning in parallel, and by implementing the whole system as a neural net. In addition, such a system provides an approach to some aspects of the problems of noise, uncertainty and novelty in reasoning systeras. We are accordingly modifying our current neural net system (Conposit), which performs standard rulebased reasoning, into a massively parallel case-based reasoning version. t This work has been supported in part by grant AFOSR-88-0215 from the Air Force Office of Scientific Research and grant NAGW-1592 under the hmovative Research Program of the NASA Office of Space Science and Applications.
منابع مشابه
A neural network model of causality
This paper proposes a model for commonsense causal reasoning, based on the basic idea of neural networks. After an analysis of the advantages and limitations of existing accounts of causality, a fuzzy logic based formalism FEL is proposed that takes into account the inexactness and the cumulative evidentiality of commonsense causal reasoning, overcoming the limitations of existing accounts. Ana...
متن کاملMassively Parallel Case-Based Reasoning with Probabilistic Similarity Metrics
We propose a probabilistic case-space metric for the case matching and case adaptation tasks. Central to our approach is a probability propagation algorithm adopted from Bayesian reasoning systems, which allows our case-based reasoning system to perform theoretically sound probabilistic reasoning. The same probability propagation mechanism actually ooers a uniform solution to both the case matc...
متن کاملMassively Parallel Simulation of Structured Connectionist Networks: An Interim Report
We map structured connectionist models of knowledge representation and reasoning onto existing general purpose massively parallel architectures with the objective of developing and implementing practical, realtime knowledge base systems. Shruti, a connectionist knowledge representation and reasoning system which attempts to model reflexive reasoning, will serve as our representative connectioni...
متن کاملMassively Parallel Memory-Based Parsing
This paper discusses a radically new scheme of natural language processing called massively parallel memory-based parsing. Most parsing schemes are rule-based or principle-based which involves extensive serial rule application. Thus, it is a time consuming task which requires a few seconds or even a few minutes to complete the parsing of one sentence. Also, the degree of par-allelism attained b...
متن کاملConnectionist Models of Rule-Based Reasoning
We investigate connectionist models of rule-based reasoning, and show that while such models usually carry out reasoning in exactly the same way as symbolic systems, they have more to ooer in terms of commonsense reasoning. A connection-ist architecture for commonsense reasoning, CON-SYDERR, is proposed to account for common-sense reasoning patterns and to remedy the brit-tleness problem in tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- International Journal of Man-Machine Studies
دوره 36 شماره
صفحات -
تاریخ انتشار 1992